The Berlekamp-Massey Algorithm. A Sight from Theory of Pade Approximants and Orthogonal Polynomials
نویسندگان
چکیده
In this paper we interpret the Berlekamp-Massey algorithm (BMA) for synthesis of linear feedback shift register (LFSR) as an algorithm computing Pade approximants for Laurent series over arbitrary field. This interpretation of the BMA is based on a iterated procedure for computing of the sequence of polynomials orthogonal to some sequence of polynomial spaces with scalar product depending on the given Laurent series. It is shown that the BMA is equivalent to the Euclidean algorithm of a conversion of Laurent series in continued fractions.
منابع مشابه
Convergence of Linear and Nonlinear Pade Approximants from Series of Orthogonal Polynomials
Analogues of the Nuttall-Pommerenke theorem and Wallin-type theorems for classical Pade approximants, are proved for linear and nonlinear Pade approximants formed from series of orthogonal polynomials, corresponding to a distribution da(x) with at most finitely many sign changes.
متن کاملProperties of Multivariate Homogeneous Orthogonal Polynomials
It is well-known that the denominators of Pade approximants can be considered as orthogonal polynomials with respect to a linear functional. This is usually shown by defining Pade -type approximants from so-called generating polynomials and then improving the order of approximation by imposing orthogonality conditions on the generating polynomials. In the multivariate case, a similar constructi...
متن کاملSome Aspects of Hankel Matrices in Coding Theory and Combinatorics
Hankel matrices consisting of Catalan numbers have been analyzed by various authors. DesainteCatherine and Viennot found their determinant to be ∏ 1≤i≤j≤k i+j+2n i+j and related them to the Bender Knuth conjecture. The similar determinant formula ∏ 1≤i≤j≤k i+j−1+2n i+j−1 can be shown to hold for Hankel matrices whose entries are successive middle binomial coefficients (2m+1 m ) . Generalizing t...
متن کاملThe Berlekamp-Massey Algorithm via Minimal Polynomials
We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain D. This theorem is relative to any element of D. The ingredients are: the arithmetic of Laurent polynomials over D, a recursive ’index function’ and simple mathematical induction. Taking reciprocals gives a ’Berlekamp-Massey theorem’ i.e. a recursive construction of the polynomials arising ...
متن کاملNew permutation codes using Hadamard unscrambling
Another viewpoint is presented on the derivation of theBerlekamp-Massey algorithm. Our approach differs from previous ones inthe following manner. The properties of the shortest linear feedback shiftregister that generates a given sequence are first derived without referenceto the Berlekamp-Massey algorithm. The Berlekamp-Massey algorithm isthen derived using these propertie...
متن کامل